A Soft Type Assignment System for λ-Calculus
نویسندگان
چکیده
Soft Linear Logic (SLL) is a subsystem of second-order linear logic with restricted rules for exponentials, which is correct and complete for PTIME. We design a type assignment system for the λ-calculus (STA), which assigns to λ-terms as types (a proper subset of) SLL formulas, in such a way that typable terms inherit the good complexity properties of the logical system. Namely STA enjoys subject reduction and normalization, and it is correct and complete for PTIME and FPTIME.
منابع مشابه
Resource control and intersection types: an intrinsic connection
In this paper we investigate the λ-calculus, a λ-calculus enriched with resource control. Explicit control of resources is enabled by the presence of erasure and duplication operators, which correspond to thinning and contraction rules in the type assignment system. We introduce directly the class of λ-terms and we provide a new treatment of substitution by its decomposition into atomic steps. ...
متن کاملType Inference for a Polynomial Lambda Calculus
We study the type inference problem for the Soft Type Assignment system (STA) for λ-calculus introduced in [1], which is correct and complete for polynomial time computations. In particular we design an algorithm which, given in input a λ-term, provides all the constraints that need to be satisfied in order to type it. For the propositional fragment of STA, the satisfiability of the constraints...
متن کاملFrom light logics to type assignments: a case study
Using Soft Linear Logic (SLL) as case study, we analyze a method for transforming a light logic into a type assignment system for the λ-calculus, inheriting the complexity properties of the logics. Namely the typing assures the strong normalization in a number of steps polynomial in the size of the term, and moreover all polynomial functions can be computed by λ-terms that can be typed in the s...
متن کاملIntersection-types à la Church
In this paper, we present Λ∧, a fully typed λ-calculus based on the intersection-type system discipline, which is a counterpart à la Church of the type assignment system as invented by Coppo and Dezani. The relationship between Λ∧ and the intersection type assignment system is the standard isomorphism between typed and type assignment system, and so the typed language inherits from the untyped ...
متن کاملIntersection Typed λ - calculus
The aim of this paper is to discuss the design of an explicitly typed λ-calculus corresponding to the Intersection Type Assignment System (IT ), which assigns intersection types to the untyped λ-calculus. Two different proposals are given. The logical foundation of all of them is the Intersection Logic IL.
متن کامل